Characterizing Fairness Implementability

نویسنده

  • Yuh-Jzer Joung
چکیده

We present a semantic criterion for fairness notions for multiparty interaction. We show that if a fairness notion violates the criterion, then no deterministic algorithm for multiparty interaction scheduling can satisfy the fairness requirement. Conversely, the implementation is possible if the criterion is obeyed. Thus, the criterion is suucient and necessary to guarantee fairness implementability. To our knowledge, this is the rst such criterion to appear in the literature. We then use this criterion to examine several important fairness notions, including strong interaction fairness, strong process fairness, weak process fairness, U-fairness, and hyperfairness. All, except weak process fairness, fail to pass the criterion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Fairness Notions in Distributed Systems: I. A Characterization of Implementability

This is the first part of a two-part paper in which we discuss the implementability of fairness notions in distributed systems where asynchronous processes interact via synchronous constructs—usually called multiparty interactions. In this part we present a criterion for fairness notions and show that if a fairness notion violates the criterion, then no deterministic algorithm for scheduling mu...

متن کامل

On Fairness Notions in Distributed Systems: II. Equivalence-Completions and Their Hierarchies

This is the second part of a two-part paper in which we discuss the implementability of fairness notions in distributed systems where asynchronous processes interact via multiparty interactions. We focus here on equivalence-robust fairness notions where equivalence computations are either all fair or all unfair. Francez et al. (1992, Formal Aspects Comput. 4, 582–591) propose a notion of comple...

متن کامل

Localizability of Semantic Constraints and Their Distributed Implementations

The concept of interactions has been widely used in distributed programming languages and algebraic models of concurrency to model synchronization and nondeterminism among processes. The combined eeects of synchronization and nondeterminism, however, may also introduce undesirable computations, usually because they violate some liveness property. Therefore, a semantic constraint (sometimes call...

متن کامل

DRONEE: Dual-radio opportunistic networking for energy efficiency

Reducing the power consumption of smartphones is becoming more and more important as smartphones become an indispensable component of our daily activities. In this work, we propose a novel scheme, so called DRONEE, that dramatically ameliorates energy efficiency for uplink transmissions, while achieving near-optimal throughput and high fairness levels in cellular networks. Our proposal consists...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996